Bruhat Decomposition and Numerical Stability
نویسندگان
چکیده
منابع مشابه
Fast Generalized Bruhat Decomposition
The deterministic recursive pivot-free algorithms for the computation of generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as algorithm of matrix multiplication and it is suitable for the parallel computer systems.
متن کاملGeneralized Bruhat Decomposition in Commutative Domains
Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.
متن کاملShorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in Phys. Rev. A 70(052328), 2004: to implement a general stabilizer circuit, we reduce their 11-stage computation -HC-P-C-P-C-H-P-C-P-Cover the gate set consisting of Hadamard, Controlled-NOT, and Phase gates, into a 7-stage computation of the form -C-CZ-P-H-P-CZ-C-. We show...
متن کاملStraight-line programs with memory and matrix Bruhat decomposition
We advocate that straight-line programs designed for algebraic computations should be accompanied by a comprehensive complexity analysis that takes into account both the number of fundamental algebraic operations needed, as well as memory requirements arising during evaluation. We introduce an approach for formalising this idea and, as illustration, construct and analyse straight-line programs ...
متن کاملFlag Varieties and the Bruhat Decomposition MATH 7895 Lecture
For our first example, consider V = Cn. Let {e1, . . . en} be the standard basis of Cn, and fix the full flag F• = 0 ⊂ 〈e1〉 ⊂ 〈e1, e2〉 ⊂ · · · ⊂ 〈e1, . . . , en−1〉 ⊂ V Note that any other flag can be obtained from this one by acting with an element of GLn(C). Specifically, any flag V• = 0 ⊂ V1 ⊂ · · · ⊂ Vn = V in Cn has the form V• = 0 ⊂ 〈ge1〉 ⊂ 〈ge1, ge2〉 ⊂ · · · ⊂ 〈ge1, . . . , gen〉 = V for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 1998
ISSN: 0895-4798,1095-7162
DOI: 10.1137/s0895479896303314